Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones
نویسندگان
چکیده
We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good tours of huge TSP instances, e. g., the World TSP.
منابع مشابه
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009
We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good ...
متن کاملTheory and Methodology Construction heuristics for the asymmetric TSP
Non-Euclidean traveling salesman problem (TSP) construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive eorts devoted to studying Euclidean TSP construction heuristics. This state of aairs is at odds with the fact that asymmetric models are relevant to a wider range of applications, and indeed are un...
متن کاملConstruction heuristics for the asymmetric TSP
Non Euclidean TSP construction heuristics and especially asymmetric TSP construc tion heuristics have been neglected in the literature by comparison with the extensive e orts devoted to studying Euclidean TSP construction heuristics This state of a airs is at odds with the fact that asymmetric models are relevant to a wider range of applica tions and indeed are uniformly more general that symme...
متن کاملFinding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesman Problem (TSP). The basic idea of the approach consists of iteratively transforming the TSP instance to another one with smaller size by contracting pseudo backbone edges. The iteration is stopped, if the new TSP instance is sm...
متن کاملStudy of Pseudo-Parallel Genetic Algorithm with Ant Colony Optimization to Solve the TSP
The traveling salesman problem (TSP) has attracted many researchers’ attention in the past few decades, and amounts of algorithms based on heuristic algorithms, genetic algorithms, particle swarm optimization, tabu search and memetic algorithms have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. This paper is devoted to the presentatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009